PRIP - TR - 81 July 16 , 2003 Hierarchical Image Partitioning with Dual Graph Contraction 1 Yll
نویسنده
چکیده
We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference along the boundary of two components relative to a measure of differences of the components’ internal differences. This definition tries to encapsulate the intuitive notion of contrast. Two components are merged if there is a low-cost connection between them. Each component’s internal difference is represented by the maximum edge weight of its minimum spanning tree. External differences are the smallest weight of edges connecting components. We use this idea for building a minimum spanning tree to find region borders quickly and effortlessly in a bottom-up way, based on local differences in a specific feature.
منابع مشابه
PRIP - TR - 81 July 16 , 2003 Hierarchical Image Partitioning with Dual Graph Contraction 1
We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference along the boundary of two components relative to a measure of differences of the components’ internal differences. This definition tries to encapsulate the intuitive notion of contrast. Two components are merged if there is a lo...
متن کاملHierarchy of Partitions with Dual Graph Contraction
We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference along the boundary of two components relative to a measure of differences of component’s internal differences. This definition attempts to encapsulate the intuitive notion of contrast. Two components are merged if there is a low...
متن کاملHierarchical Image Partitioning using Combinatorial Maps
We present a hierarchical partitioning of images using a pairwise similarity function on a combinatorial map based representation. We used the idea of minimal spanning tree to find region borders quickly in a bottom-up way, based on local differences. The result is a hierarchy of image partitions with multiple resolutions suitable for further goal driven analysis. The algorithm can handle large...
متن کاملDual Contraction of Combinatorial Maps
Pattern Recognition and Image Processing Group Institute of Computer Aided Automation Vienna University of Technology Treitlstr. 3/1832 A-1040 Vienna AUSTRIA Phone: +43 (1) 58801-18351 Fax: +43 (1) 5054668 E-mail: [email protected], [email protected] URL: http://www.prip.tuwien.ac.at/ PRIP-TR-54 January 29, 1999 Dual Contraction of Combinatorial Maps Luc Brun and Walter Kropatsch1 Abs...
متن کاملCombining regular decimation and dual graph contraction for hierarchical image segmentation
The Bounded Irregular Pyramid (BIP) is a hierarchical structure for image representation whose aim is to combine concepts from regular and irregular pyramids. The data structure is a combination of the simplest regular and irregular structures: the 2× 2/4 regular one and the simple graph representation. However, simple graphs only take into account adjacency relationships, being unable to corre...
متن کامل